0.03/0.13 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.03/0.14 % Command : run_E %s %d THM 0.13/0.35 % Computer : n024.cluster.edu 0.13/0.35 % Model : x86_64 x86_64 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.35 % Memory : 8042.1875MB 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.35 % CPULimit : 960 0.13/0.35 % WCLimit : 120 0.13/0.35 % DateTime : Tue Aug 9 03:31:07 EDT 2022 0.13/0.35 % CPUTime : 0.20/0.48 Running higher-order on 8 cores theorem proving 0.20/0.48 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=120 /export/starexec/sandbox/benchmark/theBenchmark.p 0.20/0.48 # Version: 3.0pre003-ho 0.20/0.49 # Preprocessing class: HSSSSMSSSSSNHHA. 0.20/0.49 # Scheduled 5 strats onto 8 cores with 120 seconds (960 total) 0.20/0.49 # Starting sh2lt with 480s (4) cores 0.20/0.49 # Starting new_ho_10_unif with 120s (1) cores 0.20/0.49 # Starting full_lambda_6 with 120s (1) cores 0.20/0.49 # Starting post_as_ho1 with 120s (1) cores 0.20/0.49 # Starting ehoh_best3_rw with 120s (1) cores 0.20/0.49 # sh2lt with pid 6565 completed with status 0 0.20/0.49 # Result found by sh2lt 0.20/0.49 # Preprocessing class: HSSSSMSSSSSNHHA. 0.20/0.49 # Scheduled 5 strats onto 8 cores with 120 seconds (960 total) 0.20/0.49 # Starting sh2lt with 480s (4) cores 0.20/0.49 # SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true) 0.20/0.49 # ...ProofStateSinE()=1/2 0.20/0.49 # Search class: HGHSF-FFSF00-SHHFFSBN 0.20/0.49 # Scheduled 6 strats onto 4 cores with 480 seconds (480 total) 0.20/0.49 # Starting new_ho_10 with 260s (1) cores 0.20/0.49 # Starting sh2lt with 49s (1) cores 0.20/0.49 # Starting new_bool_1 with 44s (1) cores 0.20/0.49 # Starting new_bool_2 with 44s (1) cores 0.20/0.49 # new_ho_10 with pid 6571 completed with status 0 0.20/0.49 # Result found by new_ho_10 0.20/0.49 # Preprocessing class: HSSSSMSSSSSNHHA. 0.20/0.49 # Scheduled 5 strats onto 8 cores with 120 seconds (960 total) 0.20/0.49 # Starting sh2lt with 480s (4) cores 0.20/0.49 # SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true) 0.20/0.49 # ...ProofStateSinE()=1/2 0.20/0.49 # Search class: HGHSF-FFSF00-SHHFFSBN 0.20/0.49 # Scheduled 6 strats onto 4 cores with 480 seconds (480 total) 0.20/0.49 # Starting new_ho_10 with 260s (1) cores 0.20/0.49 # Preprocessing time : 0.001 s 0.20/0.49 # Presaturation interreduction done 0.20/0.49 0.20/0.49 # Proof found! 0.20/0.49 # SZS status Theorem 0.20/0.49 # SZS output start CNFRefutation 0.20/0.49 thf(decl_22, type, d: $i > $o). 0.20/0.49 thf(decl_23, type, esk1_0: ($i > $o) > $i). 0.20/0.49 thf(decl_24, type, epred1_1: $i > $i > $o). 0.20/0.49 thf(cTHM143_pme, conjecture, ![X1:($i > $o) > $i]:((~((d @ (X1 @ d)))<=(((d)=(^[X2:$i]:(?[X3:$i > $o]:((~((X3 @ (X1 @ X3)))&((X2)=(X1 @ X3)))))))&![X4:$i > $o, X5:$i > $o]:((((X4)=(X5))<=((X1 @ X4)=(X1 @ X5))))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', cTHM143_pme)). 0.20/0.49 thf(c_0_1, negated_conjecture, ~(![X1:($i > $o) > $i]:(((![X9:$i]:(((d @ X9)<=>?[X3:$i > $o]:((~(X3 @ (X1 @ X3))&((X9)=(X1 @ X3))))))&![X4:$i > $o, X5:$i > $o]:((((X1 @ X4)=(X1 @ X5))=>((X4)=(X5)))))=>~(d @ (X1 @ d))))), inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM143_pme])])])])). 0.20/0.49 thf(c_0_2, negated_conjecture, ![X11:$i, X13:$i > $o, X14:$i > $o, X15:$i > $o]:((((((~(epred1_1 @ X11 @ (esk1_0 @ (epred1_1 @ X11)))|~(d @ X11))&(((X11)=(esk1_0 @ (epred1_1 @ X11)))|~(d @ X11)))&((X13 @ (esk1_0 @ X13))|((X11)!=(esk1_0 @ X13))|(d @ X11)))&(((esk1_0 @ X14)!=(esk1_0 @ X15))|((X14)=(X15))))&(d @ (esk1_0 @ d)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])). 0.20/0.49 thf(c_0_3, negated_conjecture, ![X3:$i > $o, X4:$i > $o]:((((X3)=(X4))|((esk1_0 @ X3)!=(esk1_0 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.20/0.49 thf(c_0_4, negated_conjecture, ![X3:$i > $o, X16:$i, X4:$i > $o]:((((X3 @ X16)<=>(X4 @ X16))|((esk1_0 @ X3)!=(esk1_0 @ X4)))), inference(arg_cong,[status(thm)],[c_0_3])). 0.20/0.49 thf(c_0_5, negated_conjecture, ![X2:$i]:((~((epred1_1 @ X2 @ (esk1_0 @ (epred1_1 @ X2))))|~((d @ X2)))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.20/0.49 thf(c_0_6, negated_conjecture, ![X2:$i]:((((X2)=(esk1_0 @ (epred1_1 @ X2)))|~((d @ X2)))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.20/0.49 thf(c_0_7, negated_conjecture, ![X4:$i > $o, X3:$i > $o, X2:$i]:(((X3 @ X2)|((esk1_0 @ X3)!=(esk1_0 @ X4))|~((X4 @ X2)))), inference(dynamic cnf,[status(thm)],[c_0_4])). 0.20/0.49 thf(c_0_8, negated_conjecture, ![X2:$i]:((~((epred1_1 @ X2 @ X2))|~((d @ X2)))), inference(spm,[status(thm)],[c_0_5, c_0_6])). 0.20/0.49 thf(c_0_9, negated_conjecture, ![X3:$i > $o, X2:$i]:(((epred1_1 @ (esk1_0 @ X3) @ X2)|~((d @ (esk1_0 @ X3)))|~((X3 @ X2)))), inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_7, c_0_6])])). 0.20/0.49 thf(c_0_10, negated_conjecture, ![X3:$i > $o]:((~((d @ (esk1_0 @ X3)))|~((X3 @ (esk1_0 @ X3))))), inference(spm,[status(thm)],[c_0_8, c_0_9])). 0.20/0.49 thf(c_0_11, negated_conjecture, (d @ (esk1_0 @ d)), inference(split_conjunct,[status(thm)],[c_0_2])). 0.20/0.49 thf(c_0_12, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10, c_0_11]), c_0_11])]), ['proof']). 0.20/0.49 # SZS output end CNFRefutation 0.20/0.49 # Parsed axioms : 2 0.20/0.49 # Removed by relevancy pruning/SinE : 1 0.20/0.49 # Initial clauses : 5 0.20/0.49 # Removed in clause preprocessing : 0 0.20/0.49 # Initial clauses in saturation : 5 0.20/0.49 # Processed clauses : 23 0.20/0.49 # ...of these trivial : 0 0.20/0.49 # ...subsumed : 3 0.20/0.49 # ...remaining for further processing : 20 0.20/0.49 # Other redundant clauses eliminated : 5 0.20/0.49 # Clauses deleted for lack of memory : 0 0.20/0.49 # Backward-subsumed : 0 0.20/0.49 # Backward-rewritten : 0 0.20/0.49 # Generated clauses : 35 0.20/0.49 # ...of the previous two non-redundant : 19 0.20/0.49 # ...aggressively subsumed : 0 0.20/0.49 # Contextual simplify-reflections : 0 0.20/0.49 # Paramodulations : 20 0.20/0.49 # Factorizations : 2 0.20/0.49 # NegExts : 0 0.20/0.49 # Equation resolutions : 7 0.20/0.49 # Propositional unsat checks : 0 0.20/0.49 # Propositional check models : 0 0.20/0.49 # Propositional check unsatisfiable : 0 0.20/0.49 # Propositional clauses : 0 0.20/0.49 # Propositional clauses after purity: 0 0.20/0.49 # Propositional unsat core size : 0 0.20/0.49 # Propositional preprocessing time : 0.000 0.20/0.49 # Propositional encoding time : 0.000 0.20/0.49 # Propositional solver time : 0.000 0.20/0.49 # Success case prop preproc time : 0.000 0.20/0.49 # Success case prop encoding time : 0.000 0.20/0.49 # Success case prop solver time : 0.000 0.20/0.49 # Current number of processed clauses : 12 0.20/0.49 # Positive orientable unit clauses : 1 0.20/0.49 # Positive unorientable unit clauses: 0 0.20/0.49 # Negative unit clauses : 0 0.20/0.49 # Non-unit-clauses : 11 0.20/0.49 # Current number of unprocessed clauses: 4 0.20/0.49 # ...number of literals in the above : 10 0.20/0.49 # Current number of archived formulas : 0 0.20/0.49 # Current number of archived clauses : 7 0.20/0.49 # Clause-clause subsumption calls (NU) : 33 0.20/0.49 # Rec. Clause-clause subsumption calls : 29 0.20/0.49 # Non-unit clause-clause subsumptions : 3 0.20/0.49 # Unit Clause-clause subsumption calls : 4 0.20/0.49 # Rewrite failures with RHS unbound : 0 0.20/0.49 # BW rewrite match attempts : 0 0.20/0.49 # BW rewrite match successes : 0 0.20/0.49 # Condensation attempts : 23 0.20/0.49 # Condensation successes : 0 0.20/0.49 # Termbank termtop insertions : 1102 0.20/0.49 0.20/0.49 # ------------------------------------------------- 0.20/0.49 # User time : 0.004 s 0.20/0.49 # System time : 0.003 s 0.20/0.49 # Total time : 0.007 s 0.20/0.49 # Maximum resident set size: 1892 pages 0.20/0.49 0.20/0.49 # ------------------------------------------------- 0.20/0.49 # User time : 0.012 s 0.20/0.49 # System time : 0.009 s 0.20/0.49 # Total time : 0.021 s 0.20/0.49 # Maximum resident set size: 1720 pages 0.20/0.49 EOF